光互联网的抗毁性设计研究

由于互联网层叠模型中多层都存在重复的保护与恢复机制，致使互联网的实现极其复杂，造成网络传输效率较低，而且拥塞。随着密集波分复用（DWDM）的广泛使用和网络底层性能的大幅度提高，已经不需要再对网络中多层进行重复保护与恢复。在此基础上，采用了未来光互联网3层 (应用层、IP层和光互联层) 协议模型，并对其中的光互联层的保护进行了深入的研究，提出了部分共享备用路径保护(P-SPP)方法。此模型能充分利用IP层电子的灵活恢复机制与光互联层的快速保护与恢复机制，提高光互联网的传输性能，以适应目前高速发展的互联网对传输带宽的要求。     

Vector-Orthogonality and Lanczos-Type Methods

A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open.     

DESIGN OF A NOVEL 2-D UNIPLANAR CRLH-TL STRUCTURE

A novel uniplanar 2-D composite right/left-handed transmission line (CRLH-TL) structure is proposed based on a general transmission line theory and the way to increase the relative operating bandwidth in the left-handed (LH) region and lower the LH operating frequency is illustrated. In addition, a new method to extract parameters and calculate the Bloch impedance of the structure is presented. Numerical results of the dispersion as well as the extracted parameters are given, which are calculated based on full-wave simulation. The present 2-D uniplanar CRLH-TL structure is applicable to 2-D left-handed materials in lower and wider LH frequency range. Supported by the National Natural Science Foundation of China (No. 60371010) (No. 60471037) (No. 63531020)     

固化疏浚泥作为填方材料的试验研究

港口、航道的建设和维护工程产生了大量的疏浚泥，如何处理这些疏浚泥已是国内外十分关注的问题．从资源的再生利用出发，提出利用固化材料固化疏浚泥作为填方材料的设想，并通过强度试验、溶出试验等一系列试验证实，固化疏浚泥作为填方材料在技术经济指标上完全可行．     

书籍扫描图像畸变参数自动计算方法的研究

为实现书籍扫描图像的畸变自动校正,提出用多项式来描述各像素的理论灰度g(zi)与页面上对应点到扫描仪工作平面距离zi二者之间的关系。为确立该多项式,在畸变参数已知条件下扫描一幅图像,根据已知畸变参数求出zi,即可按最小二乘法原理由各像素灰度的实际值求出多项式的各个系数。实验证明,采用4阶多项式已能满足一般要求,并求出了各系数。对任意扫描图像,自动计算畸变参数的方法为:首先利用扫描图像上页边空白处各像素的灰度,对畸变参数进行估计,并求出zi的估计值;然后代入所确立的多项式,可求得g(zi);通过调整各畸变参数的估计值,直到g(zi)与gi最为接近,即得最佳畸变参数。用于图像校正实验,获得了较好的校正效果,最大误差由不校正时的41%下降到了6.9%。这使得无需用户测量并输入有关畸变参数即可进行自动校正。     

Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations

In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Resolvent estimates in W−1,p related to strongly coupled‐linear parabolic systems with coupled nonsmooth capacities

We investigate linear parabolic systems with coupled nonsmooth capacities and mixed boundary conditions. We prove generalized resolvent estimates in W^{?1, p} spaces. The method is an appropriate modification of a technique introduced by Agmon to obtain L^p estimates for resolvents of elliptic differential operators in the case of smooth boundary conditions. Moreover, we establish an existence and uniqueness result. Copyright © 2007 John Wiley & Sons, Ltd.     

高俘获效率电子辐照加速器的设计研究

加速管是一台加速器的核心部分. 一般电子辐照加速器的俘获效率在50%左右, 一半的电子都损失在加速管内. 丢失的电子打在加速管内壁, 产生轫致辐射、腔体发热量增加、真空变坏等许多负面影响. 采用一段等梯度加速结构, 相速沿加速管呈线形增加,调整相速变化规律及加速管腔体的尺寸参数, 设计出的加速管最终的俘获效率提高到90%以上, 同时平均加速梯度没有因此降低, 加速管总长度没有增加.     

一个组合分布模型及其参数估计

本文根据极值分布理论,提出了一个由原始分布和尾分布组成的组合分布模型,研究了组合分布模型中原始分布和尾分布的确定方法,建立了组合分布模型参数估计的加权最优化模型,实例计算说明,组合分布较好地反映了风险变量极值事件的风险。